Practical Timing Analysis of Asynchronous Systems Using Time Separation of Events
نویسندگان
چکیده
We present a unified technique for timing verification and performance analysis of complex asynchronous systems designed with implicit timing assumptions. Our method models interacting controllers and datapath elements using timing constraint graphs. Performance metrics and timing constraints to be verified are formulated as time separations between appropriate events. Separations between all relevant pairs of events are computed in a single pass using an efficient time separation of events algorithm [2]. A complete asynchronous differential equation solver chip [16] has been modeled and analyzed using the techniques presented in this paper. We present results of datapath timing verification, inter-controller protocol timing verification and performance analysis of the differential equation solver using our techniques.
منابع مشابه
Timing analysis of asynchronous systems using time separation of events
This paper describes a pseudo-polynomial time algorithm for timing analysis of a class of choice-free asynchronous systems, called tightly-coupled systems, with both min and max type timing constraints and bounded component delays. The algorithm consists of two phases: (i) longterm behavior analysis, that computes bounds on the time separation of events after the system has run for a sufficient...
متن کاملPractical Timing Analysis of Asynchronous Circuits Using Time Separation of Events
We present a unified technique for timing verification and performance analysis of complex asynchronous circuits designed with implicit timing assumptions. We model interacting asynchronous controllers and datapath elements using timing constraint graphs. Performance metrics and circuit timing constraints to be checked are formulated as time separations between appropriate events. Time separati...
متن کاملEfficient Algorithms for Approximate Time Separation of Events
Finding bounds on time separation of events is a fundamental problem in verification and analysis of asynchronous and concurrent systems. Unfortunately, even for systems without repeated events or choice, computing exact bounds on time separation of events is an intractable problem when both min and max type timing constraints are present. In this paper, we describe a method for approximating m...
متن کاملProbabilistic Timing Analysis of Asynchronous Systems with Moments of Delay
Finding time separation of events is a fundamental problem in the analysis of asynchronous systems. When component delays have statistical variations, it is both interesting and useful to compute moments of time separation of events. Traditionally, Monte Carlo simulation has been used for this purpose. However, Monte Carlo simulation requires knowledge of the probability distributions of compon...
متن کاملSymbolic Time Separation of Events
We extend the TSE [14] timing analysis algorithm into the symbolic domain, that is, we allow symbolic variables to be used to specify unknown parameters of the model (essentially, unknown delays) and verification algorithms which are capable of identifying not just failure or success, but also the constraints on these symbolic variables which will ensure successful verification. The two main co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997